Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Identifieur interne : 00AF51 ( Main/Exploration ); précédent : 00AF50; suivant : 00AF52Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Auteurs : Malek Mouhoub ; François Charpillet ; Jean-Paul Haton [France]Source :
- Constraints : An International Journal ; 1998.
English descriptors
Abstract
Many temporal applications like planning and scheduling can be viewed as special cases of numeric and symbolic temporal constraint satisfaction problem. We have developed a temporal model, TemPro, based on the interval algebra, to express such applications in terms of qualitative and quantitative temporal constraints. TemPro extends the interval algebra relations of Allen to handle numeric information. To solve a constraint satisfaction problem, different approaches have been developed. These approaches generally use constraint propagation to simplify the original problem, and backtracking to directly search for possible solutions. Constraint propagation can also be used during backtracking to improve the performance of the search. The objective of this paper is to assess different policies for checking if a TemPro network is consistent. The main question we want to answer is how much constraint propagation is useful for finding a single solution for a TemPro constraint graph. For this purpose, we have randomly generated large consistent networks for which arc and/or path consistency algorithms (AC-3, AC-7 and PC-2) were applied. The main result of this study is an optimal policy combining these algorithms either at the symbolic (Allen relation propagation) or at the numerical level.
Affiliations:
- France
- Grand Est, Lorraine (région)
- Nancy
- Centre national de la recherche scientifique, Institut national de recherche en informatique et en automatique, Laboratoire lorrain de recherche en informatique et ses applications, Université de Lorraine
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 002273
- to stream Crin, to step Curation: 002273
- to stream Crin, to step Checkpoint: 002199
- to stream Main, to step Merge: 00B672
- to stream Main, to step Curation: 00AF51
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="572">Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning</title></titleStmt><publicationStmt><idno type="RBID">CRIN:mouhoub98a</idno><date when="1998" year="1998">1998</date><idno type="wicri:Area/Crin/Corpus">002273</idno><idno type="wicri:Area/Crin/Curation">002273</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">002273</idno><idno type="wicri:Area/Crin/Checkpoint">002199</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">002199</idno><idno type="wicri:Area/Main/Merge">00B672</idno><idno type="wicri:Area/Main/Curation">00AF51</idno><idno type="wicri:Area/Main/Exploration">00AF51</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning</title><author><name sortKey="Mouhoub, Malek" sort="Mouhoub, Malek" uniqKey="Mouhoub M" first="Malek" last="Mouhoub">Malek Mouhoub</name></author><author><name sortKey="Charpillet, Francois" sort="Charpillet, Francois" uniqKey="Charpillet F" first="François" last="Charpillet">François Charpillet</name></author><author><name sortKey="Haton, Jean Paul" sort="Haton, Jean Paul" uniqKey="Haton J" first="Jean-Paul" last="Haton">Jean-Paul Haton</name><affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="region" nuts="2">Lorraine (région)</region></placeName><orgName type="laboratoire" n="5">Laboratoire lorrain de recherche en informatique et ses applications</orgName><orgName type="university">Université de Lorraine</orgName><orgName type="institution">Centre national de la recherche scientifique</orgName><orgName type="institution">Institut national de recherche en informatique et en automatique</orgName></affiliation></author></analytic><series><title level="j">Constraints : An International Journal</title><imprint><date when="1998" type="published">1998</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Arc consistency</term><term>Constraint satisfaction</term><term>Path consistency</term><term>Temporal reasoning</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="5145">Many temporal applications like planning and scheduling can be viewed as special cases of numeric and symbolic temporal constraint satisfaction problem. We have developed a temporal model, TemPro, based on the interval algebra, to express such applications in terms of qualitative and quantitative temporal constraints. TemPro extends the interval algebra relations of Allen to handle numeric information. To solve a constraint satisfaction problem, different approaches have been developed. These approaches generally use constraint propagation to simplify the original problem, and backtracking to directly search for possible solutions. Constraint propagation can also be used during backtracking to improve the performance of the search. The objective of this paper is to assess different policies for checking if a TemPro network is consistent. The main question we want to answer is how much constraint propagation is useful for finding a single solution for a TemPro constraint graph. For this purpose, we have randomly generated large consistent networks for which arc and/or path consistency algorithms (AC-3, AC-7 and PC-2) were applied. The main result of this study is an optimal policy combining these algorithms either at the symbolic (Allen relation propagation) or at the numerical level.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Nancy</li></settlement><orgName><li>Centre national de la recherche scientifique</li><li>Institut national de recherche en informatique et en automatique</li><li>Laboratoire lorrain de recherche en informatique et ses applications</li><li>Université de Lorraine</li></orgName></list><tree><noCountry><name sortKey="Charpillet, Francois" sort="Charpillet, Francois" uniqKey="Charpillet F" first="François" last="Charpillet">François Charpillet</name><name sortKey="Mouhoub, Malek" sort="Mouhoub, Malek" uniqKey="Mouhoub M" first="Malek" last="Mouhoub">Malek Mouhoub</name></noCountry><country name="France"><region name="Grand Est"><name sortKey="Haton, Jean Paul" sort="Haton, Jean Paul" uniqKey="Haton J" first="Jean-Paul" last="Haton">Jean-Paul Haton</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00AF51 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00AF51 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= CRIN:mouhoub98a
|texte= Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
}}
| This area was generated with Dilib version V0.6.33. |  |